An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model
نویسندگان
چکیده
We consider a Degree-Corrected Planted-Partition model: a random graph on n nodes with two equal-sized clusters. The model parameters are two constants a, b > 0 and an i.i.d. sequence of weights (φu) n u=1, with finite second moment Φ . Vertices u and v are joined by an edge with probability φuφv n a when they are in the same class and with probability φuφv n b otherwise. We prove that it is information-theoretically impossible to estimate the spins in a way positively correlated with the true community structure when (a − b)Φ ≤ 2(a+ b). A by-product of our proof is a precise coupling-result for local-neighbourhoods in Degree-Corrected Planted-Partition models, which could be of independent interest.
منابع مشابه
Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model
In this paper, we examine a spectral clustering algorithm for similarity graphs drawn from a simple random graph model, where nodes are allowed to have varying degrees, and we provide theoretical bounds on its performance. The random graph model we study is the Extended Planted Partition (EPP) model, a variant of the classical planted partition model. The standard approach to spectral clusterin...
متن کاملPartitioning Random Graphs with General Degree Distributions
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) from a random graph. During the last 30 years many algorithms for this problem have been developed that work provably well on models resembling the Erdős-Rényi model Gn,m. Since in these random graph models edges are distributed very uniformly, the recent theory of large networks provides convinci...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملRegularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
Spectral clustering is a fast and popular algorithm for finding clusters in networks. Recently, Chaudhuri et al. [1] and Amini et al. [2] proposed inspired variations on the algorithm that artificially inflate the node degrees for improved statistical performance. The current paper extends the previous statistical estimation results to the more canonical spectral clustering algorithm in a way t...
متن کاملAn Optimization Model for Financial Resource Allocation Towards Seismic Risk Reduction
This paper presents a study on determining the degree of effectiveness of earthquake risk mitigation measures and how to prioritize such efforts in developing countries. In this paper a model is proposed for optimizing funds allocation towards risk reduction measures (building retrofitting) and reconstruction process after potential earthquakes in a regional level. The proposed model seeks opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1511.00546 شماره
صفحات -
تاریخ انتشار 2015